Strong Graphene 3D Assemblies with High Elastic Recovery and Hardness
نویسندگان
چکیده
منابع مشابه
Highly Strong and Elastic Graphene Fibres Prepared from Universal Graphene Oxide Precursors
Graphene fibres are continuously prepared from universal graphene oxide precursors by a novel hydrogel-assisted spinning method. With assistance of a rolling process, meters of ribbon-like GFs, or GRs with improved conductivity, tensile strength, and a long-range ordered compact layer structure are successfully obtained. Furthermore, we refined our spinning process to obtained elastic GRs with ...
متن کاملSwitchable supramolecular assemblies on graphene.
We studied the self-assembly of trimesic acid on single- and few-layer graphene supported by SiO2 substrates. A scanning tunneling microscope operated under ambient conditions was utilized to image supramolecular networks of trimesic acid at liquid-graphene interfaces. Trimesic acid can self-assemble into large-scale, highly ordered adlayers on graphene surfaces. Phase transition of the trimesi...
متن کاملMechanically robust 3D graphene macroassembly with high surface area.
We report the synthesis of a three-dimensional (3D) macroassembly of graphene sheets with electrical conductivity (∼10(2) S m(-1)) and Young's modulus (∼50 MPa) orders of magnitude higher than those previously reported, super-compressive deformation behavior (∼60% failure strain), and surface areas (>1300 m(2) g(-1)) approaching theoretically maximum values.
متن کاملA New Electrochemical Approach for the Synthesis of Copper-Graphene Nanocomposite Foils with High Hardness
Graphene has proved its significant role as a reinforcement material in improving the strength of polymers as well as metal matrix composites due to its excellent mechanical properties. In addition, graphene is also shown to block dislocation motion in a nanolayered metal-graphene composites resulting in ultra high strength. In the present paper, we demonstrate the synthesis of very hard Cu-Gra...
متن کاملMaximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms
Given two comparative maps, that is two sequences of markers each representing a genome, the Maximal Strip Recovery problem (MSR) asks to extract a largest sequence of markers from each map such that the two extracted sequences are decomposable into non-intersecting strips (or synteny blocks). This aims at defining a robust set of synteny blocks between different species, which is a key to unde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advanced Materials
سال: 2018
ISSN: 0935-9648,1521-4095
DOI: 10.1002/adma.201707424